The king's palace

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the 3-kings and 4-kings in multipartite tournaments

Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...

متن کامل

The Palace Project

This paper seeks definitions aiding design methodologies for evolving virtual morphologies, by the examination of one such morphology in analogue architecture: The Topkapı Palace. 1 Background The interest that instigated this study lies in a project developed earlier this year, entitled “The Bridge Project” [01], a virtual 3D structure of free associative content derived from the internet, one...

متن کامل

The Complexity of Kings

A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...

متن کامل

The Problem of the Kings

On a 2m 2n chessboard, the maximum number of nonattacking kings that can be placed is mn, since each 22 cell can have at most one king. Let f m (n) denote the number of ways that mn nonattacking kings can be placed on a 2m 2n chessboard. The purpose of this paper is to prove the following result. such that f m (n) = (c m n + d m)(m + 1) n + O(n m) (n ! 1): For every such placement of kings, the...

متن کامل

On the Domination of Kings

In this paper, we consider counting the number of ways to place kings on an k × n chessboard, such that every square is dominated by a king. Let f(k, n) be the number of dominating configurations. We consider the asymptotic behavior of the function f(k, n).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ghana Journal of Development Studies

سال: 2009

ISSN: 0855-6768

DOI: 10.4314/gjds.v6i1.48929